A Baby Steps/Giant Steps Probabilistic Algorithm for Computing Roadmaps in Smooth Bounded Real Hypersurface
نویسندگان
چکیده
منابع مشابه
A Baby Steps/Giant Steps Probabilistic Algorithm for Computing Roadmaps in Smooth Bounded Real Hypersurface
We consider the problem of constructing roadmaps of real algebraic sets. This problem was introduced by Canny to answer connectivity questions and solve motion planning problems. Given s polynomial equations with rational coefficients, of degree D in n variables, Canny’s algorithm has a Monte Carlo cost of s log(s)D 2) operations in Q; a deterministic version runs in time s log(s)D 4). A subseq...
متن کاملA baby steps/giant steps Monte Carlo algorithm for computing roadmaps in smooth compact real hypersurfaces
We consider the problem of constructing roadmaps of real algebraic sets. The problem was introduced by Canny to answer connectivity questions and solve motion planning problems. Given s polynomial equations with rational coefficients, of degree D in n variables, Canny’s algorithm has a Monte Carlo cost of s log(s)D ) operations in Q; a deterministic version runs in time s log(s)D 4). The next i...
متن کاملProbabilistic Roadmaps for Robot
The ProbabilisticRoadMap planner (PRM) has been applied with success to multiple planning problems involving robots with 3 to 16 degrees of freedom (dof) operating in known static environments. This paper describes the planner and reports on experimental and theoretical results related to its performance. PRM computation consists of a preprocessing and a query phase. Preprocessing, which is don...
متن کاملA Probabilistic Baby-step Giant-step Algorithm
In this paper, a new algorithm to solve the discrete logarithm problem is presented which is similar to the usual baby-step giant-step algorithm. Our algorithm exploits the order of the discrete logarithm in the multiplicative group of a finite field. Using randomization with parallelized collision search, our algorithm indicates some weakness in NIST curves over prime fields which are consider...
متن کاملManipulation Planning with Probabilistic Roadmaps Manipulation Planning with Probabilistic Roadmaps
This paper deals with motion planning for robots manipulating movable objects among obstacles. We propose a general manipulation planning approach capable of addressing continuous sets for modeling both the possible grasps and the stable placements of the movable object, rather than discrete sets generally assumed by the previous approaches. The proposed algorithm relies on a topological proper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2010
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-009-9239-2